Fourier Representations for Black-Box Optimization over Categorical Variables
نویسندگان
چکیده
Optimization of real-world black-box functions defined over purely categorical variables is an active area research. In particular, optimization and design biological sequences with specific functional or structural properties have a profound impact in medicine, materials science, biotechnology. Standalone search algorithms, such as simulated annealing (SA) Monte Carlo tree (MCTS), are typically used for problems. order to improve the performance sample efficiency we propose use existing methods conjunction surrogate model evaluations variables. To this end, present two different representations, group-theoretic Fourier expansion abridged one-hot encoded Boolean expansion. learn consider settings update our model. First, utilize adversarial online regression setting where characters each representation considered experts their respective coefficients updated via exponential weight rule time black box evaluated. Second, Bayesian queries selected Thompson sampling posterior sparse (over proposed representation) regularized horseshoe prior. Numerical experiments synthetic benchmarks well RNA sequence problems demonstrate representational power methods, which achieve competitive superior compared state-of-the-art counterparts, while improving computation cost and/or efficiency, substantially.
منابع مشابه
Surrogate-based methods for black-box optimization
In this paper, we survey methods that are currently used in black-box optimization, i.e. the kind of problems whose objective functions are very expensive to evaluate and no analytical or derivative information are available. We concentrate on a particular family of methods, in which surrogate (or meta) models are iteratively constructed and used to search for global solutions.
متن کاملA black-box scatter search for optimization problems with integer variables
The goal of this work is the development of a black-box solver based on the scatter search methodology. In particular, we seek a solver capable of obtaining high quality outcomes to optimization problems for which solutions are represented as a vector of integer values. We refer to these problems as integer optimization problems. We assume that the decision variables are bounded and that there ...
متن کاملConstrained Black Box Optimization with Data Analysis
This paper presents the design of and test results for an algorithm solving constrained black box optimization problems globally using mainly methods from data analysis. A particular focus is put on constraints: in addition to bound constraints, we also handle black box inequality and equality constraints. In particular, our algorithm is able to handle equality constraints given in implicit for...
متن کاملOptimal Black-Box Reductions Between Optimization Objectives
The diverse world of machine learning applications has given rise to a plethora of algorithms and optimization methods, finely tuned to the specific regression or classification task at hand. We reduce the complexity of algorithm design for machine learning by reductions: we develop reductions that take a method developed for one setting and apply it to the entire spectrum of smoothness and str...
متن کاملStudies in Continuous Black-box Optimization
O ptimization is the research field that studies that studies the design of algorithms for finding the best solutions to problems we humans throw at them. While the whole domain is of important practical utility, the present thesis will focus on the subfield of continuous black-box optimization, presenting a collection of novel, state-of-the-art algorithms for solving problems in that class. Fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2022
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v36i9.21255